Checking global graph properties by means of local computations: the majority problem
نویسندگان
چکیده
منابع مشابه
Global Graph Properties by Means ofLocal Computations : the Majority Problem 1
This paper is a contribution to the study of the general problem of characterizing those properties which can be computed on a graph or a network by means of local transformations. By using an abstract model based on graph relabelling systems we consider the majority problem : let G be a graph whose vertices have label A or B ; we say that label A has the majority if the number of A-labelled ve...
متن کاملGlobal Graph Properties byMeans of Local Computations : the Majority Problem
This paper is a contribution to the study of the general problem of characterizing those properties which can be computed on a graph or a network by means of local transformations. By using an abstract model based on graph relabelling systems we consider the majority problem : let G be a graph whose vertices have label A or B ; we say that label A has the majority if the number of A-labelled ve...
متن کاملOn Reducing the Global State Graph for Verification of Distributed Computations
Correct distributed programs are very hard to write and reason about. Verification of distributed programs with respect to their specifications is thus very important to ensure that a distributed system works as expected. Model checking has emerged as a technique used to verify the correctness of programs. However model checking techniques suffer from the global state explosion problem finite s...
متن کاملAn Optimal Approach to Local and Global Text Coherence Evaluation Combining Entity-based, Graph-based and Entropy-based Approaches
Text coherence evaluation becomes a vital and lovely task in Natural Language Processing subfields, such as text summarization, question answering, text generation and machine translation. Existing methods like entity-based and graph-based models are engaging with nouns and noun phrases change role in sequential sentences within short part of a text. They even have limitations in global coheren...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 2 شماره
صفحات -
تاریخ انتشار 1995